A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem
نویسنده
چکیده
A longest increasing subsequence problem (LIS) is a well-known combinatorial problem with applications mainly in bioinformatics, where it is used in various projects on DNA sequences. Recently, a number of generalisations of this problem were proposed. One of them is to find an LIS among all fixed-size windows of the input sequence (LISW). We propose an algorithm for the LISW problem based on cover representation of the sequence that outperforms the existing methods for some class of the input sequences.
منابع مشابه
Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition
Given a sequence π1π2 . . . πn, a longest increasing subsequence (LIS) in a window π〈l, r〉= πlπl+1 . . . πr is a longest subsequence σ = πi1πi2 . . . πiT such that l ≤ i1 < i2 < · · · < iT ≤ r and πi1 < πi2 < · · · < πiT . We consider the Lisw problem, which is to find the longest increasing subsequences in a sliding window of fixed-size w over a sequence. Formally, it is to find a LIS for ever...
متن کاملLongest increasing subsequences in sliding windows
We consider the problem of :nding the longest increasing subsequence in a sliding window over a given sequence (LISW). We propose an output-sensitive data structure that solves this problem in time O(n log log n+OUTPUT) for a sequence of n elements. This data structure substantially improves over the na?@ve generalization of the longest increasing subsequence algorithm and in fact produces an o...
متن کاملAn Optimal Algorithm for Finding the Longest Increasing Subsequence of Every Substring
Given a string S = {a1, a2, a3, · · · , an}, the longest increasing subsequence (LIS) problem is to find a subsequence of the given string such that the subsequence is increasing and its length is maximal. In a previous result, to find the longest increasing subsequences of each sliding windows with a fixed size w of a given string can be solved in O(w log log n + OUTPUT ) time, where O(w log l...
متن کاملDISCOVERY of LONGEST INCREASING SUBSEQUENCES and its VARIANTS using DNA OPERATIONS
The Longest Increasing Subsequence (LIS) and Common Longest Increasing Subsequence (CLIS) have their importance in many data mining applications. We propose algorithms to discover LIS and CLIS from varied databases. This work finds all increasing subsequences from the given database, find increasing subsequences in n sliding window, longest increasing sequences in one and more sequences, decrea...
متن کاملA Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem
The longest arc-preserving common subsequence problem is an NPhard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of arc-annotated Ribonucleic acid (RNA) sequences. In this work we propose a simple, hybrid evolutionary algorithm to tackle this problem. The most important feature of this algorithm conc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computing and Informatics
دوره 31 شماره
صفحات -
تاریخ انتشار 2012